home
***
CD-ROM
|
disk
|
FTP
|
other
***
search
/
ftp.cs.arizona.edu
/
ftp.cs.arizona.edu.tar
/
ftp.cs.arizona.edu
/
icon
/
newsgrp
/
group92c.txt
/
000067_icon-group-sender _Wed Nov 4 01:10:54 1992.msg
< prev
next >
Wrap
Internet Message Format
|
1993-01-04
|
2KB
Received: by cheltenham.cs.arizona.edu; Sat, 7 Nov 1992 16:17:48 MST
Date: 4 Nov 92 01:10:54 GMT
From: cis.ohio-state.edu!magnus.acs.ohio-state.edu!usenet.ins.cwru.edu!agate!doc.ic.ac.uk!uknet!mucs!m1!bevan@ucbvax.Berkeley.EDU (Stephen J Bevan)
Organization: Department of Computer Science, University of Manchester
Subject: readability of the algol68 report (was Re: confusing errors)
Message-Id: <BEVAN.92Nov4011054@hippo.cs.man.ac.uk>
References: <SPACKMAN.92Oct23174836@disco-sun6.dfki.uni-sb.de>
Sender: icon-group-request@cs.arizona.edu
To: icon-group@cs.arizona.edu
Status: R
Errors-To: icon-group-errors@cs.arizona.edu
In article <1992Nov3.160646.21642@ips.cs.tu-bs.de> neitzel@ips.cs.tu-bs.de (Martin Neitzel) writes:
> it [the Algol68 Revised Report] isn't exactly very readable
Sorry, I just beg to differ. Of course, you should read a gentle
introduction into two-level-grammars beforehand (Cleaveland/Uzgaliz
excellent book on "Grammars for Programming Languages" comes to mind).
I beg to differ with your differing. The method is certainly elegant,
however I don't think it is particularly _readable_. The implicationsw
of the aliasing that can occur are quite subtle and it takes a _lot_
of effort to follow them. To me, van Wijngaarden grammars are a
minimalist approach to defining a language. A (probably bad) analogy
would be using SKI combinators as your programming language,
foundationally/theoretically very nice but a bugger to work with
practically. Give me a denotational or operational definition any
day; they also have the advantage that they are easier to turn into
interpreters/compilers.
bevan